Simple maximum-likelihood decoding of generalized first-order Reed-Muller codes
نویسندگان
چکیده
منابع مشابه
Partial permutation decoding for the first-order Reed-Muller codes
Partial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), where m > 4 by finding s-PD-sets for these codes for 2 ≤ s ≤ 4. © 2008 Elsevier B.V. All rights reserved.
متن کاملMaximum Likelihood Decoding of Reed Solomon Codes
We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F ×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is ...
متن کاملGeneralized Reed-Muller Codes
the possible choices for n and k are rather thinly distributed in the class of all pairs (n, k) with k ~ n--and it is, therefore, often inefficient to make use of such codes in concrete situations (that is, when a desired pair (n, k) is far from any achievable pair). We have succeeded in overcoming this difficulty by generalizing the Reed-Muller codes in such a way that they exist for every pai...
متن کاملEfficient decoding algorithms for generalized Reed-Muller codes
OFDM, power, Reed-Muller code, decoding, algorithms, error correction Recently a class of generalised Reed-Muller codes has been suggested for use in power-controlled OFDM modulation. A number of approaches to decoding these codes have already been developed. Here we present low complexity alternatives which are inspired by the classical Reed decoding algorithm for binary Reed-Muller codes. We ...
متن کاملRecursive decoding of Reed-Muller codes
New softand hard decision decoding algorithms are presented for general Reed-Muller codes m r of length 2m and distance 2m r. We use Plotkin (u; u + v) construction and decompose code m r onto subblocks u 2 m 1 r and v 2 n m 1 r 1 o : In decoding, we rst try to nd a subblock v from the better protected code and then proceed with the block u. The likelihoods of the received symbols are recalcu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2005
ISSN: 1089-7798
DOI: 10.1109/lcomm.2005.10009